On fixed points of a compact automorphism group.

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Automorphism of a Free Metabelian Group without Fixed Points

We construct an example of an IA-automorphism of the free metabelian group of rank n ≥ 3 without nontrivial fixed points. That gives a negative answer to the question raised by Shpilrain in [5]. By a result of Bachmuth [1], such an automorphism does not exist if the rank is equal to 2.

متن کامل

The Automorphism Group of a Compact Group Action

This paper contains results on the structure of the group, DiffG(M), of equivariant C-diffeomorphisms of a free action of the compact Lie group G on M. DiffJjíAÍ) is shown to be a locally trivial principal bundle over a submanifold of T>\tf(X), X the orbit manifold. The structural group of this bundle is lf(G, M), the set of equivariant C'-diffeomorphisms which induce the identity on X. E?(G, M...

متن کامل

Automorphism Fixed Points in the Moduli Space of Semistable Bundles

Given an automorphism τ of a smooth complex algebraic curve X, there is an induced action on the moduli space M of semi-stable rank 2 holomorphic bundles with fixed determinant. We give a complete description of the fixed variety in terms of moduli spaces of parabolic bundles on the quotient curve X/〈τ〉.

متن کامل

Domains with Non-Compact Automorphism Group: A Survey

We survey results arising from the study of domains in Cn with non-compact automorphism group. Beginning with a well-known characterization of the unit ball, we develop ideas toward a consideration of weakly pseudoconvex (and even non-pseudoconvex) domains with particular emphasis on characterizations of (i) smoothly bounded domains with non-compact automorphism group and (ii) the Levi geometry...

متن کامل

Algorithms for classifying regular polytopes with a fixed automorphism group

In this paper, various algorithms used in the classifications of regular polytopes for given groups are compared. First computational times and memory usages are analyzed for the original algorithm used in one of these classifications. Second, a possible algorithm for isomorphism testing among polytopes is suggested. Then, two improved algorithms are compared, and finally, results are given for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Michigan Mathematical Journal

سال: 1970

ISSN: 0026-2285

DOI: 10.1307/mmj/1029000428